PERFORMANCE ANALYSIS OF SIX APPROXIMATION ALGORITHMS FOR THE ONE-MACHINE MAXIMUM LATENESS SCHEDULING PROBLEM WITH READY TIMES
نویسندگان
چکیده
منابع مشابه
Performance Analysis of Six Approximation Algorithms for the One - Machine Maximum Lateness Scheduling Problem with Ready Times
Hiroshi Kise Kyoto Institute of Technology Toshihid,! Ibaraki ar.d Hisashi Mine Kyoto University (Received November 24,1978; Revised March 12, 1979) Six approximation algorithms for the one-machine scheduling problem with ready and due times to minimize the maximum lateness are analyzed. The performance is measured by the relative deviation of approximate values to optimal ones. Best possible u...
متن کاملGENETIC AND TABU SEARCH ALGORITHMS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SET-UP TIMES AND DETERIORATING JOBS
This paper introduces the effects of job deterioration and sequence dependent set- up time in a single machine scheduling problem. The considered optimization criterion is the minimization of the makespan (Cmax). For this purpose, after formulating the mathematical model, genetic and tabu search algorithms were developed for the problem. Since population diversity is a very important issue in ...
متن کاملOne-Operator, Two-Machine Open Shop and Flow Shop Scheduling with Setup Times for Machines and Maximum Lateness Objective
This paper considers a scheduling problem in which a single operator completes a set of n jobs requiring operations on two machines. The operator can perform only one operation at a time, so when one machine is in use the other is idle. After developing general properties of optimal schedules, the paper develops e cient algorithms for minimizing maximum lateness. The algorithm has time complexi...
متن کاملApproximation Algorithms for the Maximum Cut Problem
Consider the problem of keeping closely related objects together and seperating unrelated objects from each other. This idea has clear applications to statistics, computer science, mathematics, social studies, and natural sciences just to name a few. To model this idea, we de ne the maximum cut problem that is simple to state but di cult to solve. The aim of this report is to provide two known ...
متن کاملA new mathematical model for single machine batch scheduling problem for minimizing maximum lateness with deteriorating jobs
Article history: Received 10 March 2010 Received in revised form July, 25, 2011 Accepted 26 July 2011 Available online 27 July 2011 This paper presents a mathematical model for the problem of minimizing the maximum lateness on a single machine when the deteriorated jobs are delivered to each customer in various size batches. In reality, this issue may happen within a supply chain in which deliv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1979
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.22.205